#include "binary_tree.hpp"

int main() {
    BinaryTree<int> tree;
    Node<int> root(5);
    Node<int> left(6);
    Node<int> right(7);

    tree.set_root(&root);
    root.set_left(&left);
    root.set_right(&right);

    Node<int> *res = tree.pre_order_search(7);
    cout << res <<endl;
    cout << &right <<endl;

    tree.infix_order_traverse();
}